Customalloc: Eecient Synthesized Memory Allocators University of Colorado at Boulder Customalloc: Eecient Synthesized Memory Allocators

نویسندگان

  • Dirk Grunwald
  • Benjamin Zorn
چکیده

The allocation and disposal of memory is a ubiquitous operation in most programs. Rarely do programmers concern themselves with details of memory allocators; most assume that memory allocators provided by the system perform well. Yet, in some applications, programmers use domain-speciic knowledge in an attempt to improve the speed or memory utilization of memory allocators. In this paper, we describe a program (CustoMalloc) that synthesizes a memory allocator customized for a speciic application. Our experiments show that the synthesized allocators are uniformly faster than the common binary-buddy (Bsd) allocator, and are more space eecient. Constructing a custom allocator requires little programmer eeort. The process can usually be accomplished in a few minutes, and yields results superior even to domain-speciic allocators designed by programmers. Our measurements show the synthesized allocators are from two to ten times faster than widely used allocators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CustoMalloc: Efficient Synthesized Memory Allocators

The allocation and disposal of memory is a ubiquitous operation in most programs. Rarely do programmers concern themselves with details of memory allocators; most assume that memory allocators provided by the system perform well. Yet, in some applications, programmers use domain-specific knowledge in an attempt to improve the speed or memory utilization of memory allocators. In this paper, we d...

متن کامل

A Concurrent Fast-fits Memory Manager University of Florida, Dept. of Cis Electronic Tr91-009

Shared memory multiprocessor systems need eecient dynamic storage allocators, both for system purposes and to support parallel programs. Most memory manager algorithms are based either on a free list, which provides eecient memory use, or on a buddy system, which provides fast allocation and release. In this paper, we present two versions of a memory manager based on the fast ts algorithm, whic...

متن کامل

A Scalable and Eecient Storage Allocator on Shared-memory Multiprocessors

An eecient dynamic storage allocator is important for time-critical parallel programs. In this paper, we present a fast and simple parallel allocator for xed size block on shared-memory multiprocessors. We show both theoretically and empirically that the allocator incurs very low lock contention. The allocator is tested with parallel simulation applications with frequent allocation and release ...

متن کامل

The Measured Cost of Conservative Garbage Collection University of Colorado at Boulder the Measured Cost of Conservative Garbage Collection

Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. Experience indicates that for many programs, dynamic storage allocation is so important that programmers feel compelled to write and use their own domain-speciic allocators to avoid t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992